New counterexamples to the cell formula in nonconvex homogenization
نویسندگان
چکیده
In this article we show that for the homogenization of multiple integrals, the quasiconvexification of the cell formula is different from the asymptotic formula in general. To this aim, we construct three examples in three different settings: the homogenization of a discrete model, the homogenization of a composite material and the homogenization of a homogeneous material on a perforated domain.
منابع مشابه
An efficient improvement of the Newton method for solving nonconvex optimization problems
Newton method is one of the most famous numerical methods among the line search methods to minimize functions. It is well known that the search direction and step length play important roles in this class of methods to solve optimization problems. In this investigation, a new modification of the Newton method to solve unconstrained optimization problems is presented. The significant ...
متن کاملAn Efficient Neurodynamic Scheme for Solving a Class of Nonconvex Nonlinear Optimization Problems
By p-power (or partial p-power) transformation, the Lagrangian function in nonconvex optimization problem becomes locally convex. In this paper, we present a neural network based on an NCP function for solving the nonconvex optimization problem. An important feature of this neural network is the one-to-one correspondence between its equilibria and KKT points of the nonconvex optimizatio...
متن کاملError Estimates for the Finite Volume Element Method for Elliptic Pde’s in Nonconvex Polygonal Domains
We consider standard finite volume piecewise linear approximations for second order elliptic boundary value problems on a nonconvex polygonal domain. Based on sharp shift estimates, we derive error estimations in H –, L2– and L∞–norm, taking into consideration the regularity of the data. Numerical experiments and counterexamples illustrate the theoretical results.
متن کاملCOUNTEREXAMPLES IN CHAOTIC GENERALIZED SHIFTS
In the following text for arbitrary $X$ with at least two elements, nonempty countable set $Gamma$ we make a comparative study on the collection of generalized shift dynamical systems like $(X^Gamma,sigma_varphi)$ where $varphi:GammatoGamma$ is an arbitrary self-map. We pay attention to sub-systems and combinations of generalized shifts with counterexamples regarding Devaney, exact Dev...
متن کاملDC Algorithm for Extended Robust Support Vector Machine
Nonconvex variants of support vector machines (SVMs) have been developed for various purposes. For example, robust SVMs attain robustness to outliers by using a nonconvex loss function, while extended [Formula: see text]-SVM (E[Formula: see text]-SVM) extends the range of the hyperparameter by introducing a nonconvex constraint. Here, we consider an extended robust support vector machine (ER-SV...
متن کامل